John’s Decompositions: Selecting a Large Part
نویسنده
چکیده
We extend the invertibility principle of J. Bourgain and L. Tzafriri to operators acting on arbitrary decompositions id = P xj ⊗xj , rather than on the coordinate one. The John’s decomposition brings this result to the local theory of Banach spaces. As a consequence, we get a new lemma of Dvoretzky-Rogers type, where the contact points of the unit ball with its maximal volume ellipsoid play a crucial role. We then apply these results to embeddings of l ∞ into finite dimensional spaces.
منابع مشابه
Desiging, Part Selecting and Fabrication Procedure of the Vaccum Section of a Leaf Vacuum Shredder Machine
Due to the massive loss of leaves in parks and green spaces and big cities such as Isfahan and the lack of domestic production of leaf vacuum shredder machine for use in large green spaces of parks, the design and construction of the collecting and recycling by the system is need so the design of the vaccum section which is one of the main parts and includes entrance, channels and ducts and exh...
متن کاملDesiging, Part Selecting and Fabrication Procedure of the Vaccum Section of a Leaf Vacuum Shredder Machine
Due to the massive loss of leaves in parks and green spaces and big cities such as Isfahan and the lack of domestic production of leaf vacuum shredder machine for use in large green spaces of parks, the design and construction of the collecting and recycling by the system is need so the design of the vaccum section which is one of the main parts and includes entrance, channels and ducts and exh...
متن کاملMethods for Evaluating, Selecting and Improving Software Clustering Algorithms Mark Shtern a Dissertation Submitted to the Faculty of Graduate Studies in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy Graduate Program in Computer Science and Engineering
A common problem that the software industry has to face is the maintenance cost of industrial software systems. One of the main reasons for the high cost of maintenance is the inherent difficulty of understanding software systems that are large, complex, inconsistent (developed using mixed methodologies, have incomplete features) and integrated. One of the approaches that has been developed to ...
متن کاملAn Arithmetic Proof of John’s Ellipsoid Theorem
Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John’s characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the ‘hard part’ of a generalization of John’s theorem and shows the difficulties of the corresponding ‘easy part’. MSC 2000. 52A21, 52A27, 46B07.
متن کاملOn Contact Points of Convex Bodies
We show that for every convex body K in R, there is a convex body H such that H ⊂ K ⊂ c ·H with c = 2.24 and H has at most O(n) contact points with the minimal volume ellipsoid that contains it. When K is symmetric, we can obtain the same conclusion for every constant c > 1. We build on work of Rudelson [5], who showed the existence of H with O(n log n) contact points. The approximating body H ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007